Myrtle: A Set-Oriented Meta-Interpreter Driven by a "Relational" Trace for Deductive Databases Debugging
نویسندگان
چکیده
Deductive databases manage large quantities of data and, in general, in a set-oriented way. The existing systems of explanation for deductive databases do not take these constraints into account. We propose a tracing technique which consists of integrating a "relational" trace and an instrumented meta-interpreter using substitution sets. The relational trace e ciently gives precise information about data extraction from the relational database. The meta-interpreter manages substitution sets and gives explanation on the deduction. The expensive aspects of meta-interpretation are reduced by the use of the trace which avoids many calculations. The exibility of meta-interpretation is preserved. It allows di erent pro les of trace to be easily produced. Key-words: deductive databases, debugging, trace, multi-SLD-AL, meta-interpreter, substitution set, instrumentation
منابع مشابه
Myrtle : A set - oriented meta - interpreter driven by a “ relational ” trace for deductive databases
Deductive databases manage large quantities of data and, in general, in a set-oriented way. The existing systems of explanation for deductive databases do not take these constraints into account. We propose a tracing technique which consists of integrating a "relational" trace and an instrumented meta-interpreter using substitution sets. The relational trace eeciently gives precise information ...
متن کاملA Set-oriented Meta-interpreter Driven by a \re- Lational" Trace for Deductive Databases Debug- Ging 1
The development of deductive databases requires tools, in particular for de-bugging. Deductive databases manage large quantity of data and, in general, in a set-oriented way. The existing systems of explanation for deductive databases do not take these constraints into account. We propose a tracing technique which consists of integrating a "relational" trace and an instrumented meta-interpreter...
متن کاملIn Proceedings of the International Conference on Logic Programming , 1999
Existing explanation systems for deductive databases show forests of proof trees. Although proof trees are often useful, they are only one possible interesting representation. We argue that an explanation system for deductive databases must be able to generate explanations at several levels of abstraction. One possible and well known technique to achieve this exibility is to instrument meta-int...
متن کاملO!-LOLA - Extending the Deductive Database System LOLA by Object-Oriented Logic Programming
This paper presents the declarative extension of the deductive database system LOLA to the object-oriented deductive database system O!-LOLA. The model used for O!-LOLA is \objects as theories", extended by state evolution. O!-LOLA combines logic programming and OO programming in two diierent w ays: First, methods are implemented as logic programs. These methods can be inherited, encapsulated a...
متن کاملUpdate Control in Deductive Object Bases1
Deductive object bases are a combination of both deductive and objectoriented databases. This dissertation investigates the problem of update control for such databases. The data model is defined as an extreme case of a deductive database with only one extensional predicate and a multitude of axioms defining the object-oriented abstraction concepts. The advantages are twofold: a distinct concep...
متن کامل